Symmetry-Breaking Constraints for Matrix Models
نویسندگان
چکیده
Many CSPs can be effectively represented and efficiently solved using matrix models, in which the matrices may have symmetry between their rows and/or columns. Eliminating all such symmetry can be very costly as there are in general exponentially many symmetries. Cost-effective methods have been proposed to break much of the symmetry, if not all. In this paper, we continue with this line of research, and propose several symmetry-breaking constraints. Experimental results confirm their value.
منابع مشابه
Reducing Symmetry in Matrix Models: SBDS v. Constraints
We discuss diierent methods of reducing symmetry in CSPs where the variables correspond to the cells of a matrix, and both the rows and the columns of the matrix are interchangeable. Two basic approaches are considered: adding symmetry-breaking constraints to the model, and breaking symmetry during search. We also show how the two approaches can be combined in this case. We empirically compare ...
متن کاملGroup-graphs associated with Row and Column Symmetries of Matrix Models: some observations
The effect of symmetry-breaking constraints is often evaluated empirically. In order to understand which symmetric configurations are removed by a set of constraints, we have to understand the underlying structure of the symmetry group in concern. A class of symmetry that frequently occurs in constraint programming is the row and column symmetries of a matrix model. In this paper, we study thes...
متن کاملOn the Complexity and Completeness of Static Constraints for Breaking Row and Column Symmetry
We consider a common type of symmetry where we have a matrix of decision variables with interchangeable rows and columns. A simple and efficient method to deal with such row and column symmetry is to post symmetry breaking constraints like DOUBLELEX and SNAKELEX. We provide a number of positive and negative results on posting such symmetry breaking constraints. On the positive side, we prove th...
متن کاملBreaking Generator Symmetry
Dealing with large numbers of symmetries is often problematic. One solution is to focus on just symmetries that generate the symmetry group. Whilst there are special cases where breaking just the symmetries in a generating set is complete, there are also cases where no irredundant generating set eliminates all symmetry. However, focusing on just generators improves tractability. We prove that i...
متن کاملSymmetry Breaking as a Prelude to Implied Constraints: A Constraint Modelling Pattern
Finite-domain constraint programming can be used to solve a wide range of problems by first modelling the problem as a set of constraints that characterise the problem’s solutions, then searching for solutions that satisfy the constraints. Experts often augment models with implied constraints and constraints that break symmetries in the model. An emerging pattern in the modelling process, highl...
متن کامل